1-Tough cocomparability graphs are hamiltonian
نویسندگان
چکیده
منابع مشابه
An update on non-Hamiltonian 54-tough maximal planar graphs
Studying the shortness of longest cycles in maximal planar graphs, we improve the upper bound on the shortness exponent of the class of 54 -tough maximal planar graphs presented by Harant and Owens [Discrete Math. 147 (1995), 301–305]. In addition, we present two generalizations of a similar result of Tkáč who considered 1-tough maximal planar graphs [Discrete Math. 154 (1996), 321–328]; we rem...
متن کاملBipartite Kneser Graphs are Hamiltonian
The Kneser graph K(n, k) has as vertices all k-element subsets of [n] := {1, 2, . . . , n} and an edge between any two vertices (=sets) that are disjoint. The bipartite Kneser graph H(n, k) has as vertices all k-element and (n−k)-element subsets of [n] and an edge between any two vertices where one is a subset of the other. It has long been conjectured that all connected Kneser graphs and bipar...
متن کامل10-Gabriel graphs are Hamiltonian
Given a set S of points in the plane, the k-Gabriel graph of S is the geometric graph with vertex set S, where pi, pj ∈ S are connected by an edge if and only if the closed disk having segment pipj as diameter contains at most k points of S \ {pi, pj}. We consider the following question: What is the minimum value of k such that the k-Gabriel graph of every point set S contains a Hamiltonian cyc...
متن کاملSparse Kneser graphs are Hamiltonian
For integers k ≥ 1 and n ≥ 2k + 1, the Kneser graph K(n, k) is the graph whose vertices are the k-element subsets of {1, . . . , n} and whose edges connect pairs of subsets that are disjoint. The Kneser graphs of the form K(2k + 1, k) are also known as the odd graphs. We settle an old problem due to Meredith, Lloyd, and Biggs from the 1970s, proving that for every k ≥ 3, the odd graph K(2k + 1,...
متن کاملWeighted Independent Perfect Domination on Cocomparability Graphs
*Supported partly by the National Science Council of the Republic of China under grant NSC82-0208-M009-050. IDIMACS permanent member. lCurrent address: Laboratory for Computer Science, MIT, Cambridge, MA 02139. Emaih [email protected].
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 1997
ISSN: 0012-365X
DOI: 10.1016/0012-365x(95)00359-5